Undecidability of Weak Bisimilarity for PA-Processes
نویسنده
چکیده
We prove that the problem whether two PA-processes are weakly bisimilar is undecidable. We combine several proof techniques to provide a reduction from Post’s correspondence problem to our problem: existential quantification technique, masking technique and deadlock elimination technique.
منابع مشابه
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes b...
متن کاملUndecidability of Weak Bisimilarity for Pushdown Processes
We prove undecidability of the problem whether a given pair of pushdown processes is weakly bisimilar. We also show that this undecidability result extends to a subclass of pushdown processes satisfying the normedness condition.
متن کاملDividing Line between Decidable PDA's and Undecidable Ones
Sénizergues has proved that language equivalence is decidable for disjoint ǫ-deterministic PDA. Stirling has showed that strong bisimilarity is decidable for PDA. On the negative side Srba demonstrated that the weak bisimilarity is undecidable for normed PDA. Later Jančar and Srba established the undecidability of the weak bisimilarity for disjoint ǫ-pushing PDA and disjoint ǫ-popping PDA. Thes...
متن کاملThe Decidability of -Pushing PDA
Sénizergues has proved that language equivalence is decidable for disjoint -deterministic PDA. Stirling has showed that strong bisimilarity is decidable for PDA. On the negative side Srba demonstrated that the weak bisimilarity is undecidable for normed PDA. Later Jančar and Srba established the undecidability of the weak bisimilarity for disjoint -pushing PDA and disjoint -popping PDA. In the ...
متن کاملUndecidability Results for Bisimilarity on Prefix Rewrite Systems
We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the decidability of bisimilarity for normed pushdown processes. This result was substantially extended by Sénizergues (1998, 2005) who showed the decidability for regular (or equational) graphs of finite out-degree (which include unn...
متن کامل